A Modified Invasive Weed Optimization Algorithm for Multiobjective Flexible Job Shop Scheduling Problems
نویسندگان
چکیده
In this paper, a modified invasive weed optimization (IWO) algorithm is presented for optimization of multiobjective flexible job shop scheduling problems (FJSSPs) with the criteria to minimize the maximum completion time (makespan), the total workload of machines and the workload of the critical machine. IWO is a bio-inspired metaheuristic that mimics the ecological behaviour of weeds in colonizing and finding suitable place for growth and reproduction. IWO is developed to solve continuous optimization problems that’s why the heuristic rule the Smallest Position Value (SPV) is used to convert the continuous position values to the discrete job sequences. The computational experiments show that the proposed algorithm is highly competitive to the state-of-the-art methods in the literature since it is able to find the optimal and best-known solutions on the instances studied.
منابع مشابه
Multiobjective Flexible Job Shop Scheduling Using a Modified Invasive Weed Optimization
Recently, many studies are carried out with inspirations from ecological phenomena for developing optimization techniques. The new algorithm that is motivated by a common phenomenon in agriculture is colonization of invasive weeds. In this paper, a modified invasive weed optimization (IWO) algorithm is presented for optimization of multiobjective flexible job shop scheduling problems (FJSSPs) w...
متن کاملA Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations
In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملMultiobjective Artificial Immune Algorithm for Flexible Job Shop Scheduling Problem
Flexible Job shop scheduling is very important in production management and combinatorial optimization. It is NP-hard problem and consists of two sub-problems: sequencing and assignment. Multiobjective Flexible Job-Shop Scheduling Problems (MFJSSP) is formulated as three-objective problem which minimizes completion time (makespan), critical machine workload and total work load of all machines. ...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کامل